GOAL as a Planning Formalism

نویسندگان

  • Koen V. Hindriks
  • Tijmen Roberti
چکیده

It has been observed that there are interesting relations between planning and agent programming. This is not surprising as agent programming was partially motivated by the lack of planners that are able to operate in dynamic, complex environments. Vice versa it has also been observed, however, that agent programming languages typically lack planning capabilities. We show in this paper that the agent programming language Goal is not only a programming language but can actually be used as a planning formalism as well. This opens up many possibilities for various approaches to mix execution and planning in agent-oriented programming. Moreover, by using the recently introduced temporal Goal we are able to include not only the stratified axioms and ADL that are part of PDDL but also plan constraints.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical Goal Networks and Goal-Driven Autonomy: Going where AI Planning Meets Goal Reasoning

Planning systems are typically told what goals to pursue and cannot modify them. Some methods (e.g., for contingency planning, dynamic replanning) can respond to execution failures, but usually ignore opportunities and do not reason about the goals themselves. Goal-Driven Autonomy (GDA) relaxes some common assumptions of classical planning (e.g., static environments, fixed goals, no unpredictab...

متن کامل

Planning with Goal Preferences and Constraints

In classical planning, the planner is given a concrete goal; it returns a plan for it or a failure message. In the latter case, the user can either quit or modify the goal. For many applications, it is more convenient to let the user provide a more elaborate specification consisting of constraints and preferences over possible goal states. Then, let the system discover a plan for the most desir...

متن کامل

Encoding HTN Planning as a Dynamic CSP

Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal is an application of the CSP formalism on hierarchical task network planning domain. An encoding of HTN planning problems as a dynamic CSP is presented. We suppose that such encoding would provide a way for search space reductio...

متن کامل

Towards Integrating Hierarchical Goal Networks and Motion Planners to Support Planning for Human-Robot Teams

Low-level motion planning techniques must be combined with high-level task planning formalisms in order to generate realistic plans that can be carried out by humans and robots. Previous attempts to integrate these two planning formalisms mostly used either Classical Planning or HTN Planning. Recently, we developed Hierarchical Goal Networks (HGNs), a new hierarchical planning formalism that co...

متن کامل

KDMAS: A Multi-Agent System for Knowledge Discovery via Planning

In the real world, there are some domain knowledge discovery problems that can be formulated into knowledge-based planning problems, such as chemical reaction process and biological pathway discovery problems (Khan et al. 2003). A view of these domain problems can be re-cast as a planning problem, such that initial and final states are known and processes can be captured as abstract operators t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009